The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal
نویسندگان
چکیده
This paper answers a query of S. Vincze (Acta Univ. Szeged, Sect. Sci. Math. 12 A (1950) 136–142): find the convex octagon with unit-length sides and minimum diameter. It also shows that the solution is -unique. The proof uses geometric arguments and a global optimization algorithm to solve a nonconvex quadratic program.
منابع مشابه
Perfect Octagon Quadrangle Systems with an upper C4-system and a large spectrum
An octagon quadrangle is the graph consisting of an 8-cycle (x1, x2, ..., x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v and index λ [OQS] is a pair (X,H), where X is a finite set of v vertices and H is a collection of edge disjoint octagon quadrangles (called blocks) which partition the edge set of λKv defined on X. An octagon quadrangl...
متن کاملDomain to Infer Octagonal Constraints with Absolute Value ?
The octagon abstract domain, devoted to discovering octagonal constraints (also called Unit Two Variable Per Inequality or UTVPI constraints) of a program, is one of the most commonly used numerical abstractions in practice, due to its quadratic memory complexity and cubic time complexity. However, the octagon domain itself is restricted to express convex sets and has limitations in handling no...
متن کاملAn Abstract Domain to Infer Octagonal Constraints with Absolute Value
The octagon abstract domain, devoted to discovering octagonal constraints (also called Unit Two Variable Per Inequality or UTVPI constraints) of a program, is one of the most commonly used numerical abstractions in practice, due to its quadratic memory complexity and cubic time complexity. However, the octagon domain itself is restricted to express convex sets and has limitations in handling no...
متن کاملA New Near Octagon and the Suzuki Tower
We construct and study a new near octagon of order (2, 10) which has its full automorphism group isomorphic to the group G2(4) : 2 and which contains 416 copies of the Hall-Janko near octagon as full subgeometries. Using this near octagon and its substructures we give geometric constructions of the G2(4)-graph and the Suzuki graph, both of which are strongly regular graphs contained in the Suzu...
متن کاملLearning a Variable-Clustering Strategy for Octagon from Labeled Data Generated by a Static Analysis
We present a method for automatically learning an effective strategy for clustering variables for the Octagon analysis from a given codebase. This learned strategy works as a preprocessor of Octagon. Given a program to be analyzed, the strategy is first applied to the program and clusters variables in it. We then run a partial variant of the Octagon analysis that tracks relationships among vari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 108 شماره
صفحات -
تاریخ انتشار 2004